• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher
  • 
    Year
  • 
    Medium
  • 
    Type
  • 
    BLLDB-Access

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Hits 1 – 14 of 14 1 Higher-order Derivatives of Weighted Finite-state Machines ... The Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing 2021; Cotterell, Ryan; Vieira, Tim. - : Underline Science Inc., 2021 BASE Show details 2 On Finding the K-best Non-projective Dependency Trees ... The Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing 2021; Cotterell, Ryan; Vieira, Tim. - : Underline Science Inc., 2021 BASE Show details 3 On Finding the K-best Non-projective Dependency Trees ... Zmigrod, Ran; Vieira, Tim; Cotterell, Ryan. - : ETH Zurich, 2021 BASE Show details 4 Efficient computation of expectations under spanning tree distributions ... Zmigrod, Ran; Vieira, Tim; Cotterell, Ryan. - : ETH Zurich, 2021 BASE Show details 5 Higher-order Derivatives of Weighted Finite-state Machines ... Zmigrod, Ran; Vieira, Tim; Cotterell, Ryan. - : ETH Zurich, 2021 BASE Show details 6 On Finding the K-best Non-projective Dependency Trees Zmigrod, Ran; Cotterell, Ryan; Vieira, Tim In: Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (2021) BASE Show details 7 Higher-order Derivatives of Weighted Finite-state Machines Zmigrod, Ran; Cotterell, Ryan; Vieira, Tim In: Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (2021) BASE Show details 8 Efficient computation of expectations under spanning tree distributions Cotterell, Ryan; Zmigrod, Ran; Vieira, Tim In: Transactions of the Association for Computational Linguistics, 9 (2021) BASE Show details 9 Efficient Sampling of Dependency Structure Vieira, Tim; Zmigrod, Ran; Cotterell, Ryan In: Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing (2021) Abstract: Probabilistic distributions over spanning trees in directed graphs are a fundamental model of dependency structure in natural language processing, syntactic dependency trees. In NLP, dependency trees often have an additional root constraint: only one edge may emanate from the root. However, no sampling algorithm has been presented in the literature to account for this additional constraint. In this paper, we adapt two spanning tree sampling algorithms to faithfully sample dependency trees from a graph subject to the root constraint. Wilson (1996(’s sampling algorithm has a running time of O(H) where H is the mean hitting time of the graph. Colbourn (1996)’s sampling algorithm has a running time of O(N3), which is often greater than the mean hitting time of a directed graph. Additionally, we build upon Colbourn’s algorithm and present a novel extension that can sample K trees without replacement in O(K N3 + K2 N) time. To the best of our knowledge, no algorithm has been given for sampling spanning trees without replacement from a directed graph. URL: https://hdl.handle.net/20.500.11850/518990 https://doi.org/10.3929/ethz-b-000518990 BASE Hide details 10 SIGMORPHON 2020 Shared Task 0: Typologically Diverse Morphological Inflection ... Vylomova, Ekaterina; White, Jennifer; Salesky, Elizabeth. - : arXiv, 2020 BASE Show details 11 Information-Theoretic Probing for Linguistic Structure ... Pimentel, Tiago; Valvoda, Josef; Maudslay, Rowan Hall. - : arXiv, 2020 BASE Show details 12 Information-Theoretic Probing for Linguistic Structure ... Pimentel, Tiago; Valvoda, Josef; Maudslay, Rowan H.. - : ETH Zurich, 2020 BASE Show details 13 Please Mind the Root: Decoding Arborescences for Dependency Parsing Vieira, Tim; Cotterell, Ryan; Zmigrod, Ran In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP) (2020) BASE Show details 14 Information-Theoretic Probing for Linguistic Structure Pimentel, Tiago; Zmigrod, Ran; Cotterell, Ryan... In: Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics (2020) BASE Show details

Mobile view All Catalogues UB Frankfurt Linguistik 0 IDS Mannheim 0 OLC Linguistik 0 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 0 Institut für Empirische Sprachwissenschaft 0 Leibniz-Centre General Linguistics (ZAS) 0 Bibliographies BLLDB 0 BDSL 0 IDS Bibliografie zur deutschen Grammatik 0 IDS Bibliografie zur Gesprächsforschung 0 IDS Konnektoren im Deutschen 0 IDS Präpositionen im Deutschen 0 IDS OBELEX meta 0 MPI-SHH Linguistics Collection 0 MPI for Psycholinguistics 0 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 14 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0